Generating conjugate directions for arbitrary matrices by matrix equations II
نویسندگان
چکیده
منابع مشابه
Conjugate points, triangular matrices, and Riccati equations
Let A be a real continuous nxn matrix on an interval T3 and let the n-vector x be a solution of the differential equation x = Ax on r. If [oc,g]er, g is called a conjugate point of a if the equation has a nontrivial solution vector x = (x1,...,xn) such that x1(a) = ... = xk(a) = x k+1(P) = ... = x (0) = 0 for some ke[l,n-l]. It is shown that the absence on (t..,t ) of a point conjugate to t, wi...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملStrassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order
The well known algorithm of Volker Strassen for matrix multiplication can only be used for (m2 ×m2) matrices. For arbitrary (n× n) matrices one has to add zero rows and columns to the given matrices to use Strassen’s algorithm. Strassen gave a strategy of how to set m and k for arbitrary n to ensure n ≤ m2 . In this paper we study the number d of additional zero rows and columns and the influen...
متن کاملFinite iterative algorithms for extended Sylvester-conjugate matrix equations
An iterative algorithm is presented for solving the extended Sylvester-conjugate matrix equation. By this iterativemethod, the solvability of thematrix equation can be determined automatically. When the matrix equation is consistent, a solution can be obtained within finite iteration steps for any initial values in the absence of round-off errors. The algorithm is also generalized to solve a mo...
متن کاملOn Integer Matrices Obeying Certain Matrix Equations
We discuss integer matrices B of odd order v which satisfy Br = ± B, BBr = vI J, BJ = O. Matrices of this kind which have zero diagonal and other elements ± 1 give rise to skew-Hadamard and n-type matrices; we show that the existence of a skew-Hadamard (n-type) matrix of order h implies the existence of skew-Hadamard (n-type) matrices of orders (h 1)5 + 1 and (h 1)7 + 1. Finally we show that, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1991
ISSN: 0898-1221
DOI: 10.1016/0898-1221(91)90233-t